A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
نویسندگان
چکیده
منابع مشابه
An improved heuristic for permutation flowshop scheduling
Flowshop scheduling deals with determination of optimum sequence of jobs to be processed on some machines in a fixed order so as to satisfy certain scheduling criteria. The general problem of scheduling has been shown to be NP-complete. Exact algorithms, such as integer programming and branch-and-bound, guarantee optimality but do not yield the optimum solution in polynomial time even for probl...
متن کاملA Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times
We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...
متن کاملA New Heuristic-em for Permutation Flowshop Scheduling
This paper applies the new developed heuristic electromagnetism-like mechanism (EM) algorithm for the permutation flowshop scheduling problem. This algorithm simulates the electromagnetism theory by considering each solution as an electrical charge. Through the attraction-repulsion of the charges, solutions move to the optimality without being trapped into local optima. We make use of random ke...
متن کاملA New Improved NEH Heuristic for Permutation Flowshop Scheduling Problems
Job evaluation and differentiation are crucial in scheduling. Since jobs can be represented by vectors of processing times, the average, standard deviation, and skewness of job processing times can be defined as the moments of their probability distribution. The first and the second moments of processing times are effective in sorting jobs (Dong et al., 2008), however they are not yet optimized...
متن کاملThe distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of identical factories or shops, each one with machines disposed in series. A set of n available jobs have to be distributed among the factories and then ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Advanced Manufacturing Technology
سال: 2010
ISSN: 0268-3768,1433-3015
DOI: 10.1007/s00170-010-3100-x